Decomposability of completely Suslin-additive families

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Additive Decomposability of Functions over Abelian Groups

Abelian groups are classified by the existence of certain additive decompositions of group-valued functions of several variables.

متن کامل

The decomposability of additive hereditary properties of graphs

An additive hereditary property of graphs is a class of simple graphs which is closed under unions, subgraphs and isomorphisms. If P1, . . . ,Pn are properties of graphs, then a (P1, . . . ,Pn)-decomposition of a graph G is a partition E1, . . . , En of E(G) such that G[Ei], the subgraph of G induced by Ei, is in Pi, for i = 1, . . . , n. We define P1⊕· · ·⊕ Pn as the property {G ∈ I : G has a ...

متن کامل

Suslin Lattices

In their work on spreading models in Banach spaces, Dilworth, Odell, and Sari [4] introduced the notion of a Suslin lower semi-lattice, a seemingly slight weakening of the notion of a Suslin tree. They posed several problems of a set theoretic nature regarding their notion. In this paper, we make a systematic study of the notion of Suslin lower semi-lattice, answering some of the questions rais...

متن کامل

On families of additive exponential sums

where f is a polynomial of degree e in n variables with coefficients in a finite field F of characteristic p, E is an overfield of F, and ψ is an additive character of F. It is interesting to ask what happens with sums S(E, f) when one varies E, or when one varies f . In order to talk precisely about the latter, we denote by P(e, n) the scheme parameterizing all polynomials in n variables of de...

متن کامل

Suslin Sets

Proof. Suppose z is in the RHS. Then, for some f ∈ Y X , z ∈ Sxfx for all x ∈ X. Hence for each x ∈ X there is y = fx so that z ∈ Sxy, so z is in the LHS. Suppose z is in the LHS. Then for each x ∈ X there is some y ∈ Y so that z ∈ Sxy. Hence for each x ∈ X the set Tx = { y : z ∈ Sxy } is not empty. By AC there is a function f ∈ Y x so that, for all x ∈ X, fx ∈ Tx. Hence, for all x ∈ X, z ∈ Sxf...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the American Mathematical Society

سال: 1981

ISSN: 0002-9939

DOI: 10.1090/s0002-9939-1981-0612719-6